D-Tree: A New Overlay with Deterministic Bounds
نویسندگان
چکیده
We present a new overlay, called theDeterministic Decentralized tree (D-tree). The D-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers) and elements are completely decoupled from each other; and (c) an efficient deterministic load-balancing mechanism is presented for the uniform distribution of elements into nodes, while at the same time probabilistic optimal bounds are provided for the congestion of operations at the nodes. The load-balancing scheme of elements into nodes is deterministic and general enough to be applied to other hierarchical tree-based overlays. This load-balancing mechanism is based on an innovative lazy weight-balancing mechanism, which is interesting in its own right.
منابع مشابه
D2-Tree: A New Overlay with Deterministic Bounds
We present a new overlay, called theDeterministic Decentralized tree (D-tree). TheD-tree compares favourably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers) and elements are completely decoupled from each other; and (c) an efficient deterministic load-balancin...
متن کاملHeuristics, LPs, and Trees on Trees: Network Design Analyses
We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree and the overlay solution is an embedded Steiner tree (or an embedded path). For the general overlay optimiza...
متن کاملProactive Route Maintenance for Tree-Based Application Layer Multicast and Its Implementations
The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over th...
متن کاملDetailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries
In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...
متن کاملA Dynamic Mechanism for Distributed Optimization of Overlay Multicast Tree
To enhance the performance of overlay multicast networks, the overlay multicast tree should be optimized. This optimization problem is a minimum diameter, degree-limited spanning tree (MDDLST) problem which is known to be NP-Hard. We present a new scheme to optimize an overlay multicast tree dynamically. Our algorithm can adapt the tree structure to the dynamic membership and network situation....
متن کامل